Tychonoff's Theorem in the Framework of Formal Topologies

In this paper we give a constructive proof of the pointfree version of Tychonoff’s theorem within formal topology, using ideas from Coquand’s proof in [7]. To deal with pointfree topology Coquand uses Johnstone’s coverages. Because of the representation theorem in [3], from a mathematical viewpoint these structures are equivalent to formal topologies but there is an essential difference also. Namely, formal topologies have been developed within Martin Löf’s constructive type theory (cf. [15]), which thus gives a direct way of formalizing them (cf. [4]). The most important aspect of our proof is that it is based on an inductive definition of the topological product of formal topologies. This fact allows us to transform Coquand’s proof into a proof by structural induction on the last rule applied in a derivation of a cover. The inductive generation of a cover, together with a modification of the inductive property proposed by Coquand, makes it possible to formulate our proof of Tychonoff’s theorem in constructive type theory. There is thus a clear difference to earlier localic proofs of Tychonoff’s theorem known in the literature (cf. [9], [10], [12], [14]). Indeed we not only avoid to use the axiom of choice, but reach constructiveness in a very strong sense. Namely, our proof of Tychonoff’s theorem supplies an algorithm which, given a cover of the product space, computes a finite subcover, provided that there exists a similar algorithm for each component space. Since type theory has been implemented on a computer (cf. [18]), an eventual strict formalization of our proof will at the same time be a computer program that executes the task of finding a finite subcover. The paper is organized as follows. In the first part we recall the basic definitions and motivations of formal topologies and introduce in this framework